OBJECT BASED DATA PARTITION ALGORITHM FOR XML DATABASE

A partition-based algorithm for clustering large-scale software systems

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...

Partition Based Path Join Algorithms for XML Data

Path expression is an important component in querying XML data. The extended preorder numbering scheme enables us to quickly determine the ancestor-descendant relationship between elements in the hierarchy of XML data. Using the numbering scheme, a path expression can be evaluated by join operations to avoid potentially high cost of tree traversals. In this paper, we first formulate XML path qu...

The Generation of XML-Based Datasets for Moving Object Database

Datasets are the basis of the database benchmarks. They are very important to researches on database theories and applications. Datasets of the moving object database benchmarks record the spatial and temporal information of the moving objects. Based on the XML-based moving object data model, the algorithms generating moving object datasets are designed in this paper. The object number, object ...

Accessing XML Data from an Object-Relational Mediator Database

From XML Schema to Object-Relational Database - An XML Schema-Driven Mapping Algorithm

Since XML becomes a crucial format for representing information, it is necessary to establish techniques for managing XML documents. A possible solution can be found in storing XML data in (object-)relational databases. For this purpose most of the existing techniques often exploit an XML schema of the stored XML data, usually expressed in DTD. But the more complex today’s applications are, the...